Reducing the retrieval time of hashing method by using predictorsNISHIHARA, S; IKEDA, K.Communications of the ACM. 1983, Vol 26, Num 12, pp 1082-1088, issn 0001-0782Article

Critères d'optimisation du temps consacré aux utilisateurs dans les systèmes d'information automatisés aux possibilités limitéesSIVKOV, V. N.Naučno-tehničeskaâ informaciâ - Vsesoûznyj institut naučnoj i tehničeskoj informacii. Seriâ 2. Informacionnye processy i sistemy. 1987, Num 8, pp 6-9, issn 0548-0027Article

The problem of time in phased array radarBILLAN, E. R.IEE conference publication. 1997, pp 563-567, issn 0537-9989, isbn 0-85296-698-9Conference Paper

Combining exclusive and continuous fingerprint classificationLIFENG SHA; XIAOOU TANG.International Conference on Image Processing. 2004, isbn 0-7803-8554-3, 5Vol, Vol2, 1245-1248Conference Paper

Identification of semantics : Balancing between complexity and validityFALELAKIS, Manolis; DIOU, Christos; DELOPOULOS, Anastasios et al.IEEE Workshop on Multimedia Signal Processing. 2004, pp 434-437, isbn 0-7803-8578-0, 1Vol, 4 p.Conference Paper

Variable speech search technique for digital VCRsKOBAYASHI, M; TAKEUCHI, A; HAMAMOTO, Y et al.SMPTE journal (1976). 1995, Vol 104, Num 7, pp 448-451, issn 0036-1682Conference Paper

On search times for early-insertion coalesced hashingPITTEL, B; JENN-HWA YU.SIAM journal on computing (Print). 1988, Vol 17, Num 3, pp 492-503, issn 0097-5397Article

A log log n data structure for three-sided range queriesFRIES, O; MEHLHORN, K; NÄHER, S et al.Information processing letters. 1987, Vol 25, Num 4, pp 269-273, issn 0020-0190Article

The analysis of a fringe heuristic for binary search treesPOBLETE, P. V; MUNRO, J. I.Journal of algorithms (Print). 1985, Vol 6, Num 3, pp 336-350, issn 0196-6774Article

Detection of repetitive patterns in action-sequences with noise in programming by demonstrationPENTEADO, Raqueline R. De M; DA SILVA, Sérgio R. P; FURUTA, Alexandre H et al.Lecture notes in computer science. 2006, pp 380-389, issn 0302-9743, isbn 3-540-45462-4, 1Vol, 10 p.Conference Paper

Fast fractal encoding algorithm using the law of cosinesWANG, Chou-Chen; LIN, Liang-Chi; TSAI, Shou-Hsuan et al.MWSCAS : Midwest symposium on circuits and systems. 2004, isbn 0-7803-8346-X, 3Vol, Vol I, 233-236Conference Paper

A constant update time finger search treeDIETZ, P. F; RAJEEV RAMAN.Information processing letters. 1994, Vol 52, Num 3, pp 147-154, issn 0020-0190Article

Máme čas na klasickou rešerši z tištěných rejstříků? = Avons nous encore le temps d'effectuer une recherche manuelle dans des index suprimés?HORKY, J; HUML, J.Československá informatika. 1986, Vol 28, Num 2, pp 40-45, issn 0322-8509Article

Optimal on-line search and sublinear time update in string matchingFERRAGINA, P; GROSSI, R.SIAM journal on computing (Print). 1998, Vol 27, Num 3, pp 713-736, issn 0097-5397Article

Cutting your online search billsBROWN, J; ELLENBOGEN, B.Online (Weston, CT). 1992, Vol 16, Num 6, pp 32-34, issn 0146-5422Article

Ein dynamisch zeit-optimierendes Abfragesystem für Textdateren auf der Grundlage der Logik-Programmierung = Un système d'accès à l'information dans les fichiers textuels basée sur la programmation logique = A system for accessing information in textual files based on logic programmingBERTSCH, E.Angewandte Informatik. 1985, Vol 27, Num 4, pp 137-144, issn 0013-5704Article

OPTIMAL TREE LISTS FOR INFORMATION STORAGE AND RETRIEVAL.STANFEL LE.1976; INFORM. SYST.; G.B.; DA. 1976; VOL. 2; NO 2; PP. 65-70; BIBL. 8 REF.Article

Compressed file length predicts search time and errors on visual displaysDONDERI, D. C; MCFADDEN, Sharon.Displays. 2005, Vol 26, Num 2, pp 71-78, issn 0141-9382, 8 p.Article

Path-based range query processing using sorted path and rectangle intersection approachHOONG KEE NG; HON WAI LEONG.Lecture notes in computer science. 2004, pp 184-189, issn 0302-9743, isbn 3-540-21047-4, 6 p.Conference Paper

Compressed compact suffix arraysMÄKINEN, Veli; NAVARRO, Gonzalo.Lecture notes in computer science. 2004, pp 420-433, issn 0302-9743, isbn 3-540-22341-X, 14 p.Conference Paper

Backtrack-free search for real-time constraint satisfactionBECK, J. Christopher; CARCHRAE, Tom; FREUDER, Eugene C et al.Lecture notes in computer science. 2004, pp 92-106, issn 0302-9743, isbn 3-540-23241-9, 15 p.Conference Paper

A composite stabilizing data structureHERMAN, Ted; PIRWANI, Imran.Lecture notes in computer science. 2001, pp 167-182, issn 0302-9743, isbn 3-540-42653-1Conference Paper

Fractal approximation coding based on cluster of range blocksPI, M; LI, D; GONG, J et al.SPIE proceedings series. 1998, pp 454-456, isbn 0-8194-3006-4Conference Paper

Effects of computer icons and figure/background area ratios and color combinations on visual search performance on an LCD monitorHUANG, Kuo-Chen.Displays. 2008, Vol 29, Num 3, pp 237-242, issn 0141-9382, 6 p.Article

Real-time decision making for large POMDPsPAQUET, Sébastien; TOBIN, Ludovic; CHAIB-DRAA, Brahim et al.Lecture notes in computer science. 2005, pp 450-455, issn 0302-9743, isbn 3-540-25864-7, 6 p.Conference Paper